Analysing Character Shapes by String Matching Techniques

نویسندگان

  • Jacky Herz
  • Roger D. Hersch
چکیده

Characters are carefully designed shapes incorporating both the design ideas of a skilled character designer [1] and the rules related to visual appearance. The visual appearance of printed characters is the result of many interacting factors: the design intentions of the type designer, the artistic creation of the different character shapes as typeface masters, the font industrialization, rendering and printing processes and, last but not least, the way the characters are perceived by human beings (Figure 1). In the last decade, the font acquisition, industrialization and rendering processes have been computerized, without however significantly modifying the way in which characters are created. The majority of type designers still hide their design intentions within manual or computer-aided type creations generally represented by contours, and filled using either black ink or a computer. By presenting the result of the design process as large size master characters, designers implicitly state their design intentions through the resulting character shapes. The font industrialization process which follows is aimed at bringing the characters into a form suitable for rendering the shape of the characters on computer-driven typesetters and page printers [2]. The process may involve some uniformizationand regularization of the original shapes, thus contradicting the designer’s original intention. Once the character shapes have become computer objects, they are subjected to rendering rules programmed by computer scientists in order to produce fonts of industrial quality on a variety of devices (displays, page printers, typesetters). But since the intentions of the original designer are lacking, programs responsible for producing the characters can only

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-character Transition String Matching Architecture Based on Aho-corasick Algorithm

A hardware string matching architecture is usually used to accelerate string matching in various applications that need to filter content in high speed such as intrusion detection systems. However, the throughput of the hardware string matching architecture inspecting data character by character is limited by the achievable highest clock rate. In this paper, we present a string matching archite...

متن کامل

On-line Handwritten Uyghur Word Recognition Using Segmentation-Based Techniques

An approach to online handwriting word recognition using segmentation-based techniques is presented in this paper. This approach is referred to as lexicon-driven approach because an optimal segmentation is generated for each string in the lexicon. Word recognition problem is transformed into matching optimization problems between the dictionary entry and the handwritten word image. The segmenta...

متن کامل

Character Recognition in Scene Images by Fast Deformable Template Matching

To recognize characters in scene images, a character segmentation method is generally required for pre-processing. However, there are problems that traditional methods are not able to segment “isolated character” which does not constitute a character string and “touching character” which is connected to other characters. Moreover, it is known that character images in scene images suffer from pe...

متن کامل

Fast Deformable Template Matching for Character Recognition in Scene Images

To recognize characters in scene images, a character segmentation method is generally required for pre-processing. However, there are problems that traditional methods are not able to segment “isolated character” which does not constitute a character string and “touching character” which is connected to other characters. Moreover, it is known that character images in scene images suffer from pe...

متن کامل

Recursive Shift Indexing: A Fast Multi-Pattern String Matching Algorithm

String matching algorithms are essential for network devices that filter packets and flows based on their payload. Applications like intrusion detection/prevention, web filtering, anti-virus, and anti-spam all raise the demand for efficient algorithms dealing with string matching. This paper presents a novel multi-pattern string matching algorithm which reduces character comparisons based on re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Publishing

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1993